Permutations with one or two 132-subsequences
نویسنده
چکیده
We prove a strikingly simple formula for the number of permutations containing exactly one subsequence of type 132. We show that this number equals the number of partitions of a convex (n + 1 )-gon into n 2 parts by noncrossing diagonals. We also prove a recursive formula for the number d, of those containing exactly two such subsequences, yielding that {d,} is P-recursive. (~) 1998 Elsevier Science B.V.
منابع مشابه
3 Longest increasing subsequences in pattern - restricted permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...
متن کاملLongest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...
متن کامل2 00 3 Longest increasing subsequences in pattern - restricted permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...
متن کاملDecomposing simple permutations, with enumerative consequences
We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences, and then we show how this result has enumerative consequences. For example, it implies that, for any r, the number of permutations with at most r copies of 132 has an algebraic generating function (this was previously proved, constructively, by Bóna and (independently) Mansour and Vai...
متن کاملO ct 2 00 6 RESTRICTED MOTZKIN PERMUTATIONS , MOTZKIN PATHS , CONTINUED FRACTIONS , AND CHEBYSHEV POLYNOMIALS
We say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist a < b such that π a < π b < π b+1. We study the distribution of several statistics in Motzkin permutations, including the length of the longest increasing and decreasing subsequences and the number of rises and descents. We also enumerate Motzkin permutations with additional restrictions, and study the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 181 شماره
صفحات -
تاریخ انتشار 1998